Parallelization of implementations of purely sequential algorithms
نویسندگان
چکیده
منابع مشابه
Parallelization of Modular Algorithms
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gröbner bases (resp. standard bases) and the modular computation of the associated primes of a zero–dimensional ideal and describe their parallel implementation in Singular. Our modular algorithms to solve problems over Q mainly consist of three parts, solving the problem ...
متن کاملParallelization of Image Segmentation Algorithms
With the rapid developments of higher resolution imaging systems, larger image data are produced. To process the increasing image data with conventional methods, the processing time increases tremendously. Image segmentation is one of the many image processing algorithms, and it is widely used in medical imaging (i.e. find tumor in MRI), robotic vision (i.e. vision-based navigation), and face r...
متن کاملLoop Parallelization Algorithms
This chapter is devoted to a comparative survey of loop parallelization algorithms. Various algorithms have been presented in the literature, such as those introduced These algorithms make use of diierent mathematical tools. Also, they do not rely on the same representation of data dependences. In this chapter, we survey each of these algorithms, and we assess their power and limitations, both ...
متن کاملDivision Algorithms and Implementations
Many algorithms have been developed for implementing division in hardware. These algorithms di er in many aspects, including quotient convergence rate, fundamental hardware primitives, and mathematical formulations. This paper presents a taxonomy of division algorithms which classi es the algorithms based upon their hardware implementations and impact on system design. Division algorithms can b...
متن کاملOn Parallelization of Static Scheduling Algorithms
| Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues of par-allelization of static scheduling and presents two eecient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine, and their performance has been evaluated. These algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2018
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2018-30(2)-2